Expected-Delay-Summing Weak Bisimilarity for Markov Automata
نویسندگان
چکیده
A new weak bisimulation semantics is defined for Markov automata that, in addition to abstracting from internal actions, sums up the expected values of consecutive exponentially distributed delays possibly intertwined with internal actions. The resulting equivalence is shown to be a congruence with respect to parallel composition for Markov automata. Moreover, it turns out to be comparable with weak bisimilarity for timed labeled transition systems, thus constituting a step towards reconciling the semantics for stochastic time and deterministic time.
منابع مشابه
Completeness Results for Undecidable Bisimilarity Problems
We establish Σ11-completeness (in the analytical hierarchy) of weak bisimilarity checking for infinite-state processes generated by pushdown automata and parallel pushdown automata. The results imply Σ11-completeness of weak bisimilarity for Petri nets and give a negative answer to the open problem stated by Jančar (CAAP’95): “does the problem of weak bisimilarity for Petri nets belong to ∆11?”
متن کاملOn the Complexity of Bisimulation Problems for Pushdown Automata
All bisimulation problems for pushdown automata are at least PSPACE-hard. In particular, we show that (1) Weak bisimilarity of pushdown automata and nite automata is PSPACE-hard, even for a small xed nite automaton, (2) Strong bisimilarity of pushdown au-tomata and nite automata is PSPACE-hard, but polynomial for every xed nite automaton, (3) Regularity ((niteness) of pushdown automata w.r.t. w...
متن کاملAcronym : MEALS Deliverable no . : 1 . 3 / 2 Title of Deliverable : Probabilistic Bisimulation for Realistic Schedulers
Weak distribution bisimilarity is an equivalence notion on probabilistic automata, originally proposed for Markov automata. It has gained some popularity as the coarsest behavioral equivalence enjoying valuable properties like preservation of trace distribution equivalence and compositionality. This holds in the classical context of arbitrary schedulers, but it has been argued that this class o...
متن کاملEfficient Verification Algorithms for One-Counter Processes
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between processes of one-counter nets (which are ‘weak’ one-counter automata) and finite-state processes is DP-hard (in particular, it means that the problem is both NP and co-NP hard). The same technique is used to demonstrate co-N...
متن کاملCost Preserving Bisimulations for Probabilistic Automata
Probabilistic automata constitute a versatile and elegant model for concurrent probabilistic systems. They are equipped with a compositional theory supporting abstraction, enabled by weak probabilistic bisimulation serving as the reference notion for summarising the effect of abstraction. This paper considers probabilistic automata augmented with costs. It extends the notions of weak transition...
متن کامل